DNSS: Dual-Normal-Space Sampling for 3-D ICP Registration

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modified ICP algorithm for normal-guided surface registration

The iterative closest point (ICP) algorithm is probably the most popular algorithm for fine registration of surfaces. Among its key properties are: a simple minimization scheme, proofs of convergence as well as the easiness to modify and improve it in many ways (e.g. use of fuzzy point correspondences, incorporation of a priori knowledge, extensions to non-linear deformations, speed-up strategi...

متن کامل

Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets

There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest neighbor algorithms that do not impose this limitation, and thus can also be used with 3-D point sets generated by structure-frommotion techniques. We shortly present the evaluated algorithms and introduce the modification...

متن کامل

Registration without ICP

We present a new approach to the geometric alignment of a point cloud to a surface and to related registration problems. The standard algorithm is the familiar ICP algorithm. Here we provide an alternative concept which relies on instantaneous kinematics and on the geometry of the squared distance function of a surface. The proposed algorithm exhibits faster convergence than ICP; this is suppor...

متن کامل

Stochastic search for 3-d shape registration

Global optimization is fundamental in many problems such as 3-d registration, which is critical for Non-Destructive Testing. Global optimization using stochastic search has been popular in human motion capture. These methods use annealing and construct a sequence of particles that approximate a likelihood, whose global mode is searched by the optimization procedure. Treating the minimization ob...

متن کامل

Algorithms for 3 D Map Segment Registration

Many applications require dimensionally accurate and detailed maps of the environment. Mobile mapping devices with laser ranging devices can generate highly detailed and dimensionally accurate coordinate data in the form of point clouds. Point clouds represent scenes with numerous discrete coordinate samples obtained about a relative reference frame defined by the location and orientation of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automation Science and Engineering

سال: 2019

ISSN: 1545-5955,1558-3783

DOI: 10.1109/tase.2018.2802725